Minimizing Makespan in A Two-Machine Flowshop Problem with Processing Time Linearly Dependent on Job Waiting Time

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...

متن کامل

Minimizing Makespan with Multiple Orders per Job in a Two Machine Flowshop with Item Processing

New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders...

متن کامل

Minimizing makespan in flowshop with time lags

We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags, denoted by Fm|θ, θ|Cmax. Time lag constraints generalize the classical precedence constraints between operations: minimal (respectively maximal) time lags indeed specify that the time elapsed between two operations must be lower(respectively upper-) bounded. We assume that such constraints ...

متن کامل

Minimizing makespan on a two-machine re-entrant flowshop

This paper focuses on a two-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1, machine 2 and then machine 1 and machine 2. We develop dominance properties, lower bounds and heuristic algorithms for the problem, a...

متن کامل

Minimizing makespan with multiple-orders-per-job in a two-machine flowshop

New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2019

ISSN: 2071-1050

DOI: 10.3390/su11246885